1. Introducere

In this paper we present a specific routing algorithm for the Atmel 6002 FPGA circuit. We define a specific cost function and a specific way of handling the connectivity list, sorting it by two main criteria: the number of stored links and the competition's cost. We implemented a routing algorithm which simultaneously treats the global and local routing. One of the advantages of considering the global routing and the detailed routing simultaneously is that the preliminary estimation of the global routing can be immediately and appropriately corrected. The algorithm may consider the side effects of the routing decisions made for one connection on the others, thus resolving the routing conflicts. According to the sorting of the connection list, we can have two kinds of optimizations: area optimization and speed optimization.